Informatics Publishing Limited

P. V. Siva Kumar ¹, Rajasekhara Rao Kurra ², Appala Naidu Tentu ³

Affiliations
1 Department of Computer Science, VNRVJIET, Hyderabad, IN
2 Sri Prakash College of Engineering, Tuni, IN
3 CR Rao AIMSCS, University of Hyderabad Campus, Hyderabad, IN

Abstract

Security is the main issue for Mobile Ad-hoc Networks MANETs). Due to unreliable wireless media, host mobility providing secure communications is a challenge. One of the important issues when applying cryptography to MANETs is how to allocate the role of the trusted authority between the nodes. Threshold cryptography provides the way to convey a shared key to a node without the aid of key infrastructure and is suitable for a secret key sharing in a MANETs. Generally, in order to have a secure communication between two (or more) parties, a secure association must be established by sharing a secret. In this paper, we propose a verifiable multi-secret sharing protocol based on an identity based signature scheme, which uses identities of the node’s available in the network. This scheme uses advantages of an identity based signature scheme and hash function for the verifiability, which we do not require much computation. It checks either dealer or participant’s honest, means dealer may distribute a fake share to a certain participant or a corrupted participant may provide a fake share to other participants in reconstruction. In previous proposed schemes [6],[13],[19], they have used one-way function, RSA, Discrete logarithm functions to keep share information in public. Their idea was choosing above mentioned functions is mostly for the purpose of verification of shares. In our scheme, we did not use any exponentiation functions, but we have used two variable one-way function for the purpose of share calculation not for the verification. Our scheme resists dealer and participants cheating behavior efficiently.

Keywords

Secret Sharing, Multi Secret Sharing, Verifiable, Threshold Scheme, Hash Function, MANETs.

Full Text

     

G. Padmavathi ¹, Shahnaz Bathul ¹, P. V. Siva Kumar ²

Affiliations
1 Department of Mathematics, JNTU Hyderabad, IN
2 Department of Computer Science, VNRVJIET, Hyderabad, IN

Abstract

In this paper continuous hysteretic neuron model has been studied and discretized the model by using proper approximation. Sufficient condition for global exponential stability of a unique equilibrium is obtained. Motivated by the applications of bidirectional associative neural networks with hysteresis in artificial neural networks, we studied the global dynamics of bidirectional associative neural network with hysteresis. The hysteretic neural network model is envisaged to be efficient and robust for various applications such as medical image processing, military data processing, etc. Hysteretic feedback control phenomena also manage glucose vs. lactose utilization preference in Escherichia coli and ensure unidirectional cell-cycle progression in eukaryotes. The result improves the earlier publications due to the bidirectional associative memory and it removes restrictions on the neutral delays. Our result shows that after discretization of hysteretic neuron models, the network converges to a stable state and this result has been applied through numerical example. The outcomes are explicit in the sense that the criteria obtained are easily verifiable as they are expressed in terms of the parameters of the system.

Keywords

Descretization, Hysteretic Neural Network, Bidirectional Associative, Global Exponential Stability.

Full Text

     

Padmavathi Guddeti ¹, P. V. Siva Kumar ², Appala Naidu Tentu ³

Affiliations
1 Department of H&S, VNR VJIET, Hyderabad, IN
2 Department of Computer Science and Engineering, VNRVJIET, Hyderabad, IN
3 CR Rao AIMSCS, University of Hyderabad Campus, Hyderabad, IN

Abstract

Secret values sharing in MANET is computationally insecure and inconsistent because of its dynamic nature. Shamir`s proposal is well known prominent secret sharing schemes. But it does not provide a dynamic approach to the particular application. In the same distribution process nodes may join or leave the network and able to obtain the similar capabilities as initial nodes; further, the joined nodes gain the shares (updated shares) corresponding to the secret. Two additional features of proposed system are that it allows to implement threshold operations, one for distributing secret information with other nodes and the other is using our threshold schemes in key management. Secret values sharing in MANET is computationally insecure and inconsistent because of its dynamic nature. Proposed the group key establishment protocol operations in detail and also proposed two different methods for dealing network dynamic nature including adding and removing of the nodes.

Keywords

Interpolation, Key Generation, Key Management, MANETs, Threshold, Secret Sharing.

Full Text

   

P. V. Siva Kumar ¹, Rajasekhara Rao Kurra ², Appala Naidu Tentu ³, G. Padmavathi ³

Affiliations
1 Department of Computer Science and Engineering, VNR VJIET, Hyderabad, IN
2 Sri Prakash College of Engineering, Tuni, IN
3 CRRao AIMSCS, University of Hyderabad Campus, Hyderabad, IN

Abstract

In this paper, we are concerned with security for Mobile Ad-hoc Networks (MANETs) using threshold cryptography. When we are applying cryptography to MANETs, key management schemes must provide the cryptographic keys in a secure manner and storing the secret information within the nodes, thwarting the activities of malicious nodes inside a network and is how to distribute the role of the trusted authority among the nodes. Mobile ad hoc networks (MANETs) represent complex distributed systems that comprise wireless mobile nodes that can freely and dynamically self-organize into arbitrary and temporary, ad-hoc network topologies. Secret Sharing Scheme is a method which distributes shares of a secret to a set of participants in such a way that only authorized subset of participants can uniquely reconstruct the secret and an unauthorized subset can get no information about the secret. In this paper we present a new multilevel secret sharing scheme by extending the Shamir's to the case that the global threshold is strictly greater than the sum of the compartment thresholds and we indicate how to use the threshold secret sharing schemes based on polynomial interpolation. These schemes are based on one-way functions (Discrete Logarithm) which are computationally perfect. In the first scheme the number of public shares grows exponentially with the number of participants. To overcome this disadvantage we proposed two efficient schemes in which the number of public shares ate linearly proportional to the number of participants. Both these schemes are similar except that in the third scheme the identities of the participants are also hidden. In this we also addressed the problem of malicious shareholders that aim to corrupt a secret sharing scheme. To prevent such a threat, legitimate shareholders must detect any modification of shares that has not been issued by a node responsible for the sharing of secret S.

Keywords

Compartmented Access Structure, Computationally Perfect, Ideal, Secret Sharing Scheme, Verifiable, MANETs.

Full Text